Nonterminal complexity of programmed grammars
Identifieur interne : 00B112 ( Main/Exploration ); précédent : 00B111; suivant : 00B113Nonterminal complexity of programmed grammars
Auteurs : Henning Fernau [Australie]Source :
- Theoretical computer science [ 0304-3975 ] ; 2003.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Langage.
English descriptors
- KwdEn :
Abstract
We show that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language. This improves the previously published bound of eight for the nonterminal complexity of these grammars. This also yields an improved nonterminal complexity bound of four for context-free matrix grammars with appearance checking. Moreover, we establish an upperbound of four on the nonterminal complexity of context-free programmed grammars without appearance checking working under leftmost derivations of type 2. We derive nonterminal complexity bounds for context-free programmed and matrix grammars with appearance checking or with unconditional transfer working under leftmost derivations of types 2 and 3, as well. More specifically, a first nonterminal complexity bound for context-free programmed grammars with unconditional transfer (working under leftmost derivations of type 3) which depends on the size of the terminal alphabet is proved.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 005383
- to stream PascalFrancis, to step Curation: 000D43
- to stream PascalFrancis, to step Checkpoint: 004E84
- to stream Main, to step Merge: 00BE69
- to stream Main, to step Curation: 00B112
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Nonterminal complexity of programmed grammars</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Electrical Engineering and Computer Science, University of Newcastle, University Drive</s1><s2>NSW 2308 Callaghan</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2308 Callaghan</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0224361</idno><date when="2003">2003</date><idno type="stanalyst">PASCAL 03-0224361 INIST</idno><idno type="RBID">Pascal:03-0224361</idno><idno type="wicri:Area/PascalFrancis/Corpus">005383</idno><idno type="wicri:Area/PascalFrancis/Curation">000D43</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004E84</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004E84</idno><idno type="wicri:doubleKey">0304-3975:2003:Fernau H:nonterminal:complexity:of</idno><idno type="wicri:Area/Main/Merge">00BE69</idno><idno type="wicri:Area/Main/Curation">00B112</idno><idno type="wicri:Area/Main/Exploration">00B112</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Nonterminal complexity of programmed grammars</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Electrical Engineering and Computer Science, University of Newcastle, University Drive</s1><s2>NSW 2308 Callaghan</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2308 Callaghan</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno><imprint><date when="2003">2003</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Alphabet</term><term>Chomsky grammar</term><term>Complexity</term><term>Construction</term><term>Context</term><term>Context free grammar</term><term>Descriptional complexity</term><term>Enumerable set</term><term>Formal language</term><term>Grammar</term><term>Language</term><term>Matrix grammar</term><term>Nonterminal complexity</term><term>Regulated rewriting</term><term>Rewriting</term><term>Size</term><term>Transfer</term><term>Turing machine</term><term>Type</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Langage formel</term><term>Grammaire</term><term>Réécriture</term><term>Complexité</term><term>Grammaire Chomsky</term><term>Construction</term><term>Machine Turing</term><term>Ensemble dénombrable</term><term>Grammaire CF</term><term>Contexte</term><term>Langage</term><term>Type</term><term>Transfert</term><term>Taille</term><term>Alphabet</term><term>Grammaire matricielle</term><term>Réécriture régulée</term><term>Complexité non terminale</term><term>Complexité description</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We show that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language. This improves the previously published bound of eight for the nonterminal complexity of these grammars. This also yields an improved nonterminal complexity bound of four for context-free matrix grammars with appearance checking. Moreover, we establish an upperbound of four on the nonterminal complexity of context-free programmed grammars without appearance checking working under leftmost derivations of type 2. We derive nonterminal complexity bounds for context-free programmed and matrix grammars with appearance checking or with unconditional transfer working under leftmost derivations of types 2 and 3, as well. More specifically, a first nonterminal complexity bound for context-free programmed grammars with unconditional transfer (working under leftmost derivations of type 3) which depends on the size of the terminal alphabet is proved.</div></front></TEI><affiliations><list><country><li>Australie</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B112 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B112 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:03-0224361
|texte= Nonterminal complexity of programmed grammars
}}
| This area was generated with Dilib version V0.6.33. |  |